Block-triangular Preconditioners for Systems Arising from Edge-preserving Image Restoration
نویسندگان
چکیده
Signal and image restoration problems are often solved by minimizing a cost function consisting of an `2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization functions. In specific, half-quadratic regularization as a fixed-point iteration method is usually employed to solve this problem. The main aim of this paper is to solve the above-described signal and image restoration problems with the half-quadratic regularization technique by making use of the Newton method. At each iteration of the Newton method, the Newton equation is a structured system of linear equations of a symmetric positive definite coefficient matrix, and may be efficiently solved by the preconditioned conjugate gradient method accelerated with the modified block SSOR preconditioner. Our experimental results show that the modified block-SSOR preconditioned conjugate gradient method is feasible and effective for further improving the numerical performance of the half-quadratic regularization approach. Mathematics subject classification: 65C20, 65F10.
منابع مشابه
Block Triangular Preconditioners for -matrices and Markov Chains
BLOCK TRIANGULAR PRECONDITIONERS FOR -MATRICES AND MARKOV CHAINS MICHELE BENZI AND BORA UÇAR Abstract. We consider preconditioned Krylov subspace methods for solving large sparse linear systems under the assumption that the coefficient matrix is a (possibly singular) -matrix. The matrices are partitioned into block form using graph partitioning. Approximations to the Schur complement are used t...
متن کاملPreconditioning Methods for Shift-Variant Image Reconstruction
Preconditioning methods can accelerate the convergence of gradient-based iterative methods for tomographic image reconstruction and image restoration. Circulant preconditioners have been used extensively for shiftinvariant problems. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. For inverse p...
متن کاملConjugate-gradient preconditioning methods for shift-variant PET image reconstruction
Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inve...
متن کاملConjugate-Gradient Preconditioning Methods For Shift-Variant PET Image Reconstruction - Image Processing, IEEE Transactions on
Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inve...
متن کاملBlock Triangular Preconditioners for M-matrices and Markov Chains
We consider preconditioned Krylov subspace methods for solving large sparse linear systems under the assumption that the coefficient matrix is a (possibly singular) M -matrix. The matrices are partitioned into 2×2 block form using graph partitioning. Approximations to the Schur complement are used to produce various preconditioners of block triangular and block diagonal type. A few properties o...
متن کامل